منابع مشابه
Fast Best-Match Shape Searching in Rotation Invariant Metric Spaces
The matching of two-dimensional shapes is an important problem with applications in domains as diverse as biometrics, industry, medicine and zoology. The distance measure used must be invariant to many distortions, including scale, offset, noise, partial occlusion, etc. Most of these distortions are relatively easy to handle, either in the representation of the data or in the similarity measure...
متن کاملCompleteness in Probabilistic Metric Spaces
The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...
متن کاملUniformities in fuzzy metric spaces
The aim of this paper is to study induced (quasi-)uniformities in Kramosil and Michalek's fuzzy metric spaces. Firstly, $I$-uniformity in the sense of J. Guti'{e}rrez Garc'{i}a and $I$-neighborhood system in the sense of H"{o}hle and u{S}ostak are induced by the given fuzzy metric. It is shown that the fuzzy metric and the induced $I$-uniformity will generate the same $I$-neighborhood system. ...
متن کاملSimilarity Join in Metric Spaces Using eD-Index
Similarity join in distance spaces constrained by the metric postulates is the necessary complement of more famous similarity range and the nearest neighbor search primitives. However, the quadratic computational complexity of similarity joins prevents from applications on large data collections. We present the eD-Index, an extension of D-index, and we study an application of the eDIndex to imp...
متن کاملOn Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. The indexing itself is either static (the whole database is indexed at once) or dynamic (insertions/deletions are supported), but there is always a preprocessing step needed. In this paper, we propose D-file, the first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2003
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm176-1-4